منابع مشابه
Regular tree languages and quasi orders
Regular languages were characterized as sets closed with respect to monotone well-quasi orders. A similar result is proved here for tree languages. Moreover, families of quasi orders that correspond to positive varieties of tree languages and varieties of finite ordered algebras are characterized.
متن کاملDeterministic Fuzzy Automaton on Subclasses of Fuzzy Regular ω-Languages
In formal language theory, we are mainly interested in the natural language computational aspects of ω-languages. Therefore in this respect it is convenient to consider fuzzy ω-languages. In this paper, we introduce two subclasses of fuzzy regular ω-languages called fuzzy n-local ω-languages and Buchi fuzzy n-local ω-languages, and give some closure properties for those subclasses. We define a ...
متن کاملRegularity for !-languages based on well-quasi-orders
This paper proposed the su cient and necessary condition for the regularity of !-languages in terms of a Well-Quasi-Order (WQO). That is, an !-language L is regular if and only if L is -closed and convergenceclosed under some monotonic WQO .
متن کاملLanguages vs . ω - Languages in Regular Infinite
Infinite games are studied in a format where two players, called Player 1 and Player 2, generate a play by building up an ω-word as they choose letters in turn. A game is specified by the ω-language which contains the plays won by Player 2. We analyze ω-languages generated from certain classes K of regular languages of finite words (called ∗-languages), using natural transformations of ∗-langua...
متن کاملWell - Quasi - Orders Christian
Based on Isabelle/HOL’s type class for preorders, we introduce a type class for well-quasi-orders (wqo) which is characterized by the absence of “bad” sequences (our proofs are along the lines of the proof of Nash-Williams [1], from which we also borrow terminology). Our main results are instantiations for the product type, the list type, and a type of finite trees, which (almost) directly foll...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2004
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2004.03.052